The early introduction of dynamic programming into computational biology

نویسنده

  • David Sankoff
چکیده

In 1994–1995, DIMACS sponsored a theme year on computational biology. Among the numerous seminars and workshops was one organized by Alberto Apostolico and Raffaele Giancarlo, recapitulated in their 1998 paper, on the history and motivations for sequence comparison. In my participation in this event, I was led to consider some of the early interactions, at the Centre de recherches mathématiques (CRM) and elsewhere, in the field now known as computational biology. A short time earlier, I had read a 1989 paper by Walter Goad on the impact of Stanislaw Ulam in this field. The penultimate sentence in this article was a quote from Ulam himself ‘I started all this’, which puzzled me greatly. As far as I knew, Ulam had no impact in the early development of the field, and while he gave talks on it at least from 1971 (cf. Ulam, 1972), the distance he defined was already published (Levenshtein, 1965) and the problem he proposed had already been solved, for all intents and purposes, in the molecular biology literature (Needleman and Wunsch, 1970) and elsewhere (Vintsyuk, 1968). I had also read a joint interview of Ulam and Mark Kac by Feigenbaum (1982), and this led me to reflect on this misperception on the part of Ulam (and of Goad), and to crystallize the realization that ironically, Kac, his colleague of many years, had played a crucial, if indirect, role in the earliest development of the field, especially that associated with the Centre de recherches mathématiques (CRM). Despite the fact that Kac had no personal research interest in the field, his encouragement of a number of junior mathematicians, and his role, intentional or not, in bringing researchers together, recur as important influences in several aspects of computational biology, and explain why I dedicate this article to his memory. In presenting some of these thoughts to the DIMACS workshop, focusing on the early 1970s, my understanding of this period was broadened by comments from a number of participants, particularly Jerrold Griggs and Pavel Pevzner, and clarified by the presentation immediately

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modern Computational Applications of Dynamic Programming

Computational dynamic programming, while of some use for situations typically encountered in industrial and systems engineering, has proved to be of much greater significance in many areas of computer science. We review some of these applications here.

متن کامل

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

متن کامل

gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences

Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...

متن کامل

A Multi-Objective Fuzzy Approach to Closed-Loop Supply Chain Network Design with Regard to Dynamic Pricing

During the last decade, reverse logistics networks received a considerable attention due to economic importance and environmental regulations and customer awareness. Integration of leading and reverse logistics networks during logistical network design is one of the most important factors in supply chain. In this research, an Integer Linear Programming model is presented to design a multi-layer...

متن کامل

Solving a Two-Period Cooperative Advertising Problem Using Dynamic Programming

Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bioinformatics

دوره 16 1  شماره 

صفحات  -

تاریخ انتشار 2000